Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection
نویسندگان
چکیده
منابع مشابه
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
We consider the feasibility model of multi-agent scheduling on a single machine, where each agent’s objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial ...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملA Survey of Single Machine Scheduling to Minimize Weighted Number of Tardy Jobs
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time pj and due date dj . The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is Cj > dj and on-time otherwise. This paper assesses works done to minimize the...
متن کاملPreemptive scheduling of equal-length jobs to maximize weighted throughput
We study the problem of computing a preemptive schedule of equal-length jobs with given release times and deadlines. Each job is assigned a weight, and our goal is to maximize the weighted throughput, which is the total weight of completed jobs. In Graham’s notation this problem is described as (1|rj ; pj=p; pmtn| ∑ wjUj). We provide an O(n )-time algorithm for this problem, improving the previ...
متن کاملSingle Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost
In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operational Research
سال: 2021
ISSN: 1109-2858,1866-1505
DOI: 10.1007/s12351-021-00627-4